A Calculus of Constructions with Explicit Subtyping
نویسنده
چکیده
The calculus of constructions can be extended with an infinite hierarchy of universes and cumulative subtyping. Subtyping is usually left implicit in the typing rules. We present an alternative version of the calculus of constructions where subtyping is explicit. We avoid problems related to coercions and dependent types by using the Tarski style of universes and by adding equations to reflect equality. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Coq à la Tarski: a predicative calculus of constructions with explicit subtyping
The predicative Calculus of Inductive Constructions (pCIC), the theory behind the Coq proof system, contains an infinite hierarchy of predicative universes T ype 0 ∈ T ype 1 ∈ T ype 2 ∈. .. and an impredicative universe P rop for propositions, together with an implicit cumulativity relation P rop ⊆ T ype 0 ⊆ T ype 1 ⊆ T ype 2 ⊆. .. . Subtyping in Coq is implicit, and is handled by the kernel. A...
متن کاملConstructor Subtyping in the Calculus of Inductive Constructions
The Calculus of Inductive Constructions (CIC) is a powerful type system, featuring dependent types and inductive deenitions, that forms the basis of proof-assistant systems such as Coq and Lego. We extend CIC with constructor subtyping, a basic form of subtyping in which an inductive type is viewed as a subtype of another inductive type if has more elements than. It is shown that the calculus i...
متن کاملThe Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping
In this paper, we introduce a new type system, the Implicit Calculus of Constructions, which is a Curry-style variant of the Calculus of Constructions that we extend by adding an intersection type binder— called the implicit dependent product. Unlike the usual approach of Type Assignment Systems, the implicit product can be used at every place in the universe hierarchy. We study syntactical pro...
متن کاملCPO-Models for Second Order Lambda Calculus with Recursive Types and Subtyping
In this paper we present constructions of cpo models for second order lambda calculi with recursive types and/or subtyping. The model constructions are based on a model construction by ten Eikelder and Hemerik for second order lambda calculus with recursive types ([tEH89a]). The models will be compatible with conventional denotational semantics. For each of the systems we consider, the general ...
متن کاملExplicit Effect Subtyping (Extended Version)
As popularity of algebraic effects and handlers increases, so does a demand for their efficient execution. Eff, an ML-like language with native support for handlers, has a subtyping-based effect system on which an effect-aware optimizing compiler could be built. Unfortunately, in our experience, implementing optimizations for Eff is overly error-prone because its core language is implicitly-typ...
متن کامل